On Lattice Complements
نویسندگان
چکیده
منابع مشابه
Counting complements in the partition lattice, and hypertrees
A partition n = {A,, . . . . A,) of the set [n] = { 1, . . . . n} is an (unordered) family of nonempty subsets A,, . . . . A, of [n] which are pairwise disjoint and whose union is [n]. We call the Ai the blocks of rc, and let 1x1 =m. A partition {B,, . . . . B,} is a refinement of {A,, . . . . A,} if each Bj lies in some Ai. It is well known (but of no relevance in this paper) that the ordering...
متن کاملOn Perturbations of Ideal Complements
Let F[x] be the space of polynomials in d variables, let GN be the Grassmannian of N -dimensional subspaces of F[x] and let JN stand for the family of all ideals in F[x] of codimension N . For a given G ∈ GN we let JG := {J ∈ JN : J ∩G = {0}} Is it true, that (with appropriate topology on JN ) the set JG is dense in JN? In general the answer is ”No”. What is even more surprising, that there are...
متن کاملComplements ?
This paper revises the interdependence between flexible technology and product innovation in the context of a monopolistic firm. Previous literature argued that flexible machinery reduces the cost of incremental innovation. To take interactions beyond the fixed cost into account, we introduce a 2-period optimization model where technology, innovation and price are chosen first, then stochastic ...
متن کاملDifferential Equations on Hyperplane Complements
The goal of the next two talks is to (1) discuss a class of integrable connections associated to root systems (2) describe their monodromy in terms of quantum groups These connections come in two forms: • Rational form leading to representations of braid groups (this week) • Trigonometric form leading to representations of affine braid groups (next week) The relevance of these connections is th...
متن کاملThe Polynomial Functions on Frobenius Complements
We determine the number of unary polynomial functions on all Frobenius complements and on all finite solvable groups all of whose abelian subgroups are cyclic. 1. Notation and results Let (G, ·) be a group. A unary polynomial function p : G → G is a function that can be written in the form p(x) := a0x a1x e1 · · · an−1xan, where n ∈ N0, a0, . . . , an are in G, and e0, . . . , en−1 are integers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Glasgow Mathematical Association
سال: 1965
ISSN: 2040-6185,2051-2104
DOI: 10.1017/s2040618500035103